/*
 * Copyright (c) 2011, okazoh_tk. All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions are met:
 *
 *  - Redistributions of source code must retain the above copyright notice,
 *    this list of conditions and the following disclaimer.
 *  - Redistributions in binary form must reproduce the above copyright notice,
 *    this list of conditions and the following disclaimer in the documentation
 *    and/or other materials provided with the distribution.
 *  - Neither the name of the copyright holder nor the names of its contributors
 *    may be used to endorse or promote products derived from this software
 *    without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
 * POSSIBILITY OF SUCH DAMAGE.
 */

#ifndef ALKES_TEXTEND_ARRAY_H_INCLUDED_
#define ALKES_TEXTEND_ARRAY_H_INCLUDED_

#include "alkes/internal.h"
#include "alkes/core/Types.h"
#include "alkes/core/TExtendBuffer.h"

namespace alkes {

/// \addtogroup core
//@{

template<class T>
class TExtendArray
{
public:
    TExtendArray(uint16_t expand_count = 8);
    ~TExtendArray();

    void clear();

    uint32_t length() const;
    bool isEmpty() const { return 0 == length(); }

    const T& operator[](uint32_t idx) const { return *get(idx); }

    const T get(uint32_t idx) const;
    T get(uint32_t idx);
    void set(uint32_t idx, const T value);

    /** Add value to last.
    */
    void push(const T value);

    /** Remove value from last.
    */
    T pop();

    T top() const;

private:
    uint32_t count_;
    TExtendBuffer<CopyExtendPolicy<StdlibAllocator> > buffer_;
};

template<class T>
TExtendArray<T>::TExtendArray(uint16_t expand_count)
: count_(0)
, buffer_(sizeof(T) * expand_count)
{
}

template<class T>
TExtendArray<T>::~TExtendArray()
{
}

template<class T>
void TExtendArray<T>::clear()
{
    count_ = 0;
}

template<class T>
uint32_t TExtendArray<T>::length() const
{
    return count_;
}

template<class T>
const T TExtendArray<T>::get(uint32_t idx) const
{
    if (count_ <= idx)
        return 0;

    return *(reinterpret_cast<const T*>(buffer_.pointer()) + idx);
}

template<class T>
T TExtendArray<T>::get(uint32_t idx)
{
    if (count_ <= idx)
        return 0;

    return *(reinterpret_cast<const T*>(buffer_.pointer()) + idx);
}

template<class T>
void TExtendArray<T>::set(uint32_t idx, const T value)
{
    void* p = buffer_.getBuffer((idx + 1) * sizeof(T));
    if (!p)
        return ;

    count_ = idx + 1;

    *(reinterpret_cast<T*>(p) + idx) = value;
}

template<class T>
void TExtendArray<T>::push(const T value)
{
    // Add to last.
    set(length(), value);
}

template<class T>
T TExtendArray<T>::pop()
{
    T ret = get(count_ - 1);
    --count_;
    return ret;
}

template<class T>
T TExtendArray<T>::top() const
{
    if (count_ <= 0)
        return (T)0;

    return get(count_ - 1);
}

//@}

}

#endif
